A Fractional-Order Primal-Dual Denoising Algorithm
نویسندگان
چکیده
Objective: By combining fractional calculus and duality theory, a novel fractional-order primal-dual model which is equivalent with the fractional ROF model is proposed. We theoretically analyze its structural similarity with the saddle-point optimization model. So the algorithms for solving the saddle-point problem can be used for solving the model. Methods: The primal-dual algorithm based on resolvent for solving the saddle-point problem is used for solving the proposed model. The adaptive variable step size iterative optimization strategy is used, which can improve the optimizing efficiency, and remedy the step size limitation of the traditional numerical algorithms. In order to guarantee the convergence of the algorithm, the range of the parameter is given. Results: The experiment results show that the proposed fractional-order primal-dual model is effective in avoiding the staircase effect and preserving texture and detail information, and the adoptive numerical algorithm has faster convergence speed. Conclusion: This paper proposes a fractional-order primal-dual denoising model, which can be solved by a primal-dual algorithm based on resolvent. The experiment results show that the proposed model can improve the image visual effect effectively, and the adoptive numerical algorithm has faster convergence speed. Keywordsimage denoising; fractional-order; primaldual; saddle-point problem; variation method
منابع مشابه
An Adaptive Fractional-Order Variation Method for Multiplicative Noise Removal
This paper aims to develop a convex fractional-order variation model for image multiplicative noise removal, where the regularization parameter can be adjusted adaptively according to balancing principle at each iterations to control the trade-off between the fitness and smoothness of the denoised images. In the light of the saddle-point theory, a primal-dual algorithm has been applied to solve...
متن کاملA General Framework for a Class of First Order Primal-dual Algorithms for Tv Minimization
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, UCLA CAM Report [08-34], May 2008], draw connections to similar methods and discuss convergence of several special cases and modifications. In particular, we point out a convergence result fo...
متن کاملA General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, UCLA CAM Report [08-34], May 2008] to a broader class of convex optimization problems. In addition, we survey several closely related methods and explain the connections to PDHG. We point out...
متن کاملUsing Fractional Primal-Dual to Schedule Split Intervals with Demands
Given a limited resource (such as bandwidth or memory) we consider the problem of scheduling requests from clients that are given as groups of non-intersecting time intervals. Each request j is associated with a demand (the amount of resource required), dj , a t-interval , which consists of up to t segments, for some t ≥ 1, and a weight, w(j). A schedule is a collection of requests. It is feasi...
متن کاملA Dual Formulation of the TV-Stokes Algorithm for Image Denoising
We propose a fast algorithm for image denoising, which is based on a dual formulation of a recent denoising model involving the total variation minimization of the tangential vector field under the incompressibility condition stating that the tangential vector field should be divergence free. The model turns noisy images into smooth and visually pleasant ones and preserves the edges quite well....
متن کامل